Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps
نویسندگان
چکیده
Inspection planning, the task of planning motions for a robot that enable it to inspect set points interest, has applications in domains such as industrial, field, and medical robotics. can be computationally challenging, search space over motion plans grows exponentially with number interest inspect. We propose novel method, Incremental Random Inspection-roadmap Search (IRIS), computes inspection whose length successfully inspected asymptotically converge those an optimal plan. IRIS incrementally densifies motion-planning roadmap using sampling-based algorithm performs efficient near-optimal graph resulting is generated. prove under very general assumptions about environment. demonstrate IRIS’s efficacy on simulated planar five DOF manipulator, bridge Unmanned Aerial Vehicle (UAV), endoscopic continuum parallel surgical cluttered human anatomy. In all these systems higher-quality orders magnitudes faster than prior state-of-the-art method.
منابع مشابه
Efficient asymptotically-optimal path planning on manifolds
This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as ...
متن کاملSparse roadmap spanners for asymptotically near-optimal motion planning
Asymptotically optimal planners, such as PRM∗, guarantee that solutions approach optimal as the number of iterations increases. Roadmaps with this property, however, may grow too large for storing on resource-constrained robots and for achieving efficient online query resolution. By relaxing optimality, asymptotically near-optimal planners produce sparser graphs by not including all edges. The ...
متن کاملInformed Asymptotically Near-Optimal Planning for Field Robots with Dynamics
Recent progress in sampling-based planning has provided performance guarantees in terms of optimizing trajectory cost even in the presence of significant dynamics. The STABLE SPARSE RRT (SST) algorithm has these desirable path quality properties and achieves computational efficiency by maintaining a sparse set of state-space samples. The current paper focuses on field robotics, where workspace ...
متن کاملAsymptotically Near-Optimal Is Good Enough for Motion Planning
Asymptotically optimal motion planners guarantee that solutions approach optimal as more iterations are performed. There is a recently proposed roadmap-based method that provides this desirable property, the PRM∗ approach, which minimizes the computational cost of generating the roadmap. Even for this method, however, the roadmap can be slow to construct and quickly grows too large for storage ...
متن کاملAsymptotically-optimal Path Planning on Manifolds
This paper presents an approach for optimal path planning on implicitly-defined configuration spaces such as those arising, for instance, when manipulating an object with two arms or with a multifingered hand. In this kind of situations, the kinematic and contact constraints induce configuration spaces that are manifolds embedded in higher dimensional ambient spaces. Existing sampling-based app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 2023
ISSN: ['1741-3176', '0278-3649']
DOI: https://doi.org/10.1177/02783649231171646